The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography

The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography

Given any fixed nonnegative integer values h and k, the L(h, k)-labelling problem consists in an assignment of nonnegative integers to the nodes of a graph such that adjacent nodes receive values which differ by at least h, and nodes connected by a 2 length path receive values which differ by at least k. The span of an L(h, k)-labelling is the difference between the largest and the smallest ass...

Computing by Graph Transformation a Survey and Annotated Bibliography Edited By

On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract)

Given an undirected graph G, an L(h, k)-labelling of G assigns colors to vertices from the integer set {0, . . . , λh,k}, such that any two vertices vi and vj receive colors c(vi) and c(vj) satisfying the following conditions: i) if vi and vj are adjacent then |c(vi)− c(vj)| ≥ h; ii) if vi and vj are at distance two then |c(vi)− c(vj)| ≥ k. The aim of the L(h, k)-labelling problem is to minimiz...

Quadratic and Three Dimensional Assignments: An Annotated Bibliography

The amount of literature on quadratic assignment and related problems has already grown so much that overviewing it to determine the most relevant developments and the most recent trends becomes more and more diicult. This paper provides a collection of references on quadratic and three dimensional assignment problems together with brief annotations. We consider all aspects of the quadratic ass...

An Annotated Bibliography for Post - solutionAnalysis in Mixed Integer Programming andCombinatorial

This annotated bibliography focuses on what has been published since the 1977 Geoorion-Nauss survey, and it is in BibT E X format, so it can be searched on the World Wide Web. In addition to postoptimal sensitivity analysis, this survey includes debugging a run, such as when the integer program is unbounded, anomalous or infeasible.